Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((ZHAO Bing[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Malicious code detection method based on icon similarity analysis
YANG Ping, ZHAO Bing, SHU Hui
Journal of Computer Applications 2019, 39 (
6
): 1728-1734. DOI:
10.11772/j.issn.1001-9081.2018112259
Abstract
(
484
)
PDF
(1200KB)(
313
)
Knowledge map
Save
According to statistics, a large part of large amount of malicious codes belong to deceptive malicious codes. They usually use icons which are similar to those icons commonly used softwares to disguise themselves and deceive users to click to achieve the purpose of communication and attack. Aiming at solving the problems of low efficiency and high cost of traditional malicious code detection methods based on code and behavior characteristics on the deceptive malicious codes, a new malicious code detection method was proposed. Firstly, Portable Executable (PE) file icon resource information was extracted and icon similarity analysis was performed by image hash algorithm. Then, the PE file import table information was extracted and a fuzzy hash algorithm was used for behavior similarity analysis. Finally, clustering and local sensitive hash algorithms were adopted to realize icon matching, designing and implementing a lightweight and rapid malicious code detection tool. The experimental results show that the designed tool has a good detection effect on malicious code.
Reference
|
Related Articles
|
Metrics
Select
Network public opinion prediction by empirical mode decomposition-autoregression based on extreme gradient boosting model
MO Zan, ZHAO Bing, HUANG Yanying
Journal of Computer Applications 2018, 38 (
3
): 615-619. DOI:
10.11772/j.issn.1001-9081.2017071846
Abstract
(
725
)
PDF
(731KB)(
833
)
Knowledge map
Save
With the arrival of big data, network public opinion data reveals the features of massive information and wide coverage. For the complicated network public opinion data, traditional single models may not efficiently predict the trend of network public opinion. To address this question, the improved combination model based on the Empirical Mode Decomposition-AutoRegression (EMD-AR) model was proposed, called EMD-ARXG (Empirical Mode Decomposition-AutoRegression based on eXtreme Gradient boosting)model. EMD-ARXG model was applied to the prediction of the trend of complex network public opinion. In this model, the Empirical Mode Decomposition (EMD) algorithm was employed to decompose the time series, and then AutoRegression (AR) model was applied to fit the decomposed time series and establish sub-models. Finally, the sub-models were reconstructed and then the modelling process was completed. In addition, in the fitting process AR model, in order to reduce the fitting error, the residual error was learned by eXtreme Gradient Boosting (XGBoost), and each sub-model was iteratively updated to improve its prediction accuracy. In order to verify the prediction performance of EMD-ARXG model, the proposed model was compared with wavelet neural network model and back propagation neural network based on EMD model. The experimental results show that the EMD-ARXG model is superior to two other models in terms of the statistical indicators including Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and Theil Inequality Coefficient (TIC).
Reference
|
Related Articles
|
Metrics
Select
Identity-based key management scheme for Ad Hoc network
SUN Mei ZHAO Bing
Journal of Computer Applications 2012, 32 (
01
): 104-106. DOI:
10.3724/SP.J.1087.2012.00104
Abstract
(
1280
)
PDF
(612KB)(
729
)
Knowledge map
Save
According to the characteristics of Ad Hoc networks, such as mobility and self-organization, an identity-based key management scheme for Ad Hoc networks was proposed. In the paper, by the method of secure distributed key generation based on threshold cryptography, the interior members of Ad Hoc networks collaborated to conduct the system private key. Compared with the existent protocol, the proposed scheme, does not require the fixed structure of service nodes, and service nodes can dynamically join and leave network. At the same time, the system key is updatable among service nodes. The analytical results show the proposed scheme is flexible and secure, and it is suitable for Mobile Ad Hoc Network (MANET).
Reference
|
Related Articles
|
Metrics